import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: lishuo
 * Date: 2023-03-27
 * Time: 15:27
 */
public class TestDemo01 {
    public static void main1(String[] args) {
//        System.out.println(Math.PI);
        int k = 1;
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            int c = scanner.nextInt();

            if (a >= 3 || a < 0 || b >= 5 || b < 0 || c >= 7 || c < 0) {
                System.out.printf("Case %d: No answer\n", k++);
                return;
            }

            int i = 1;
            int total = 7 * i + c;
            while (total < 100) {
                if ((total - b) % 5 == 0 && (total - a) % 3 == 0) {
                    System.out.printf("Case %d: %d\n", k++, total);
                    break;
                }
                i++;
                total = 7 * i + c;
            }
            if (total > 100 || total < 10) {
                System.out.printf("Case %d: No answer\n", k++);
            }
        }
    }

    public static void main2(String[] args) {
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        long n = scanner.nextLong();
        if (n < 1) {
            return;
        }

        while (n != 1) {
            if (n % 2 == 0) {
                n /= 2;
                count++;
            } else {
                n = 3 * n + 1;
                count++;
            }
        }
        System.out.println(count);
    }

    public static void main3(String[] args) {
        int k = 1;
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int n = scanner.nextInt();
            int m = scanner.nextInt();
            if (m == n && m == 0 || (n >= m)) {
                return;
            }
            double total = 0.0;
            for (long i = n; i <= m; i++) {
                total += 1.0 / (i * i);
            }
            System.out.printf("Case %d: %.5f\n", k++, total);


        }
    }

    public static void main4(String[] args) {
        int count = 1100;
        while (count <= 9999) {
            for (int i = 1; i <= 9; i++) {
                int tmp = count + i * 11;
                if (Math.sqrt(tmp) * Math.sqrt(tmp) == tmp) {
                    System.out.println(tmp);
                }
            }
            count += 1100;
        }
    }

    public static void main5(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();
        double h = scanner.nextDouble();
        double solution = 2 * Math.PI * r * h + 2 * Math.PI * r * r;
        System.out.printf("Area = %.3f\n", solution);
    }


    public static void main6(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        int[] array = new int[n + 1];

        for (int i = 2; i <= k; i++) {
            for (int j = 1; j < n + 1; j++) {
                if (j % i == 0) {
                    array[j] = array[j] == 1 ? 0 : 1;
                }
            }
        }


        for (int i = 1; i < array.length; i++) {
            if (array[i] == 0) {
                System.out.print(i + " ");
            }

        }
    }

    //妈的，没写出来

    public static void main7(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int time = 1;
        while (true) {
            int n = scanner.nextInt();
            int[] arr = new int[n];
            if (n == 0) {
                break;
            }
            // 输入答案序列
            for (int i = 0; i < n; i++) {
                int x = scanner.nextInt();
                arr[i] = x;
            }

            // 输入猜的序列
            System.out.printf("Game %d:\n",time);
            while (true) {
                int[] tmp = new int[n];
                int[] diff = new int[n];

                int count = 0;
                int difcount = 0;
                int sum = 0;
                // 每一趟比较
                for (int i = 0; i < n; i++) {
                    // 4 3 5 5
                    int x = scanner.nextInt();
                    sum+=x;
                    //相同位置相同
                    // 1 3 5 5
                    if (arr[i]==x) {
                        // 记录相同序列
                        tmp[count] = x;
                        count++;
                    } else {
                        // 记录不同序列
                        for (int j = 0; j < n; j++) {
                            if (arr[j]==x) {
                                diff[difcount] = x;
                                difcount++;
                                break;
                            }
                        }
                    }
                }
                for (int j = 0; j < difcount; j++) {
                    for (int k = 0; k < count; k++) {
                        if (diff[j]==tmp[k]) {
                            difcount--;
                        }
                    }
                }
                if (sum==0) {
                    break;
                } else {
                    System.out.printf("(%d,%d)\n",count,difcount);
                }
            }
            time++;

        }

    }

    public static void main8(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int result = 1;
            while (x!=0) {
                result *= x;
                x--;
            }
            System.out.println(result);
        }
    }

    public static void main9(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            int tmp = scanner.nextInt();
            // 初始化max为第一个数字
            int max = scanner.nextInt();
            // 找最大值
            for (int j = 1; j < tmp; j++) {
                int x = scanner.nextInt();
                if (x>max) {
                    max = x;
                }
            }
            System.out.println(max);
        }
    }

    public static int getFib(int x) {
        int fib1 = 1;
        int fib2 = 1;
        while (x > 2) {
            int tmp = fib1;
            fib1 = fib2;
            fib2 = tmp+fib2;
            x--;
        }
        return fib2;
    }

    public static void main10(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            System.out.println(getFib(x));
        }
    }

    public static void main11(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            while (x%y!=0) {
                int tmp = x;
                x = y;
                y = tmp%y;
            }
            System.out.println(y);
        }
    }

    public static void main12(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            int max = x>y?x:y;
            while (max%x!=0 || max%y!=0) {
                max++;
            }
            System.out.println(max);
        }
    }

    public static void main13(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();
        int count =0;
        for (int i = N; i <= M; i++) {
            if (i%2==0 && i%3==0 && i%7!=0) {
                count++;
            }
        }
        System.out.println(count);
    }

    public static void main14(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            int tmp = scanner.nextInt();
            // 初始化max为第一个数字
            int min = scanner.nextInt();
            // 找最大值
            for (int j = 1; j < tmp; j++) {
                int x = scanner.nextInt();
                if (x<min) {
                    min = x;
                }
            }
            System.out.println(min);
        }
    }

    public static int getK(int[] array,int k) {
        // 冒泡排序
        for (int i = 0; i < array.length-1; i++) {
            int flag = 0;
            for (int j = 0; j < array.length-1-i; j++) {
                if (array[j]>array[j+1]) {
                    int tmp = array[j+1];
                    array[j+1] =array[j];
                    array[j] = tmp;
                    flag = 1;
                }
            }
            if (flag == 0) {
                break;
            }
        }

        return array[k-1];
    }

    public static void main15(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        int k = scanner.nextInt();
        int[] array = new int[m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                array[j] = scanner.nextInt();
            }
            System.out.println(getK(array,k));
        }
    }

    // 百元白鸡问题
    public static void main16(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int n = scanner.nextInt();
            int m = scanner.nextInt();
            for (int i = 0; i <=100/5 ; i++) {
                for (int j = 0; j <=100/3 ; j++) {
                    if ((100-i-j)/3.0+i*5+j*3==100) {
                        System.out.print(i+" "+j+" "+(100-j-i));
                        System.out.println();
                    }
                }
            }
        }
    }

    // 除法问题
    public static int s = 0;
    public static void main17(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] a = new int[5];
        int[] b = new int[10];
        Perm(0,a,b,n);

        if (s==0) {
            System.out.println("no answer");
        }
    }


//    public static int[] a = new int[5];
//    public  static int[] b = new int[10];
    public static void check (int[] a,int[] b,int n) {
        // 计算5个数的数值
        int y = 0;
        for (int i = 0; i < 5; i++) {
            y=a[i]+y*10;
        }
        // 存一份临时值，方便后续更改
        int ret = y*n;
        if (ret>99999) {
            return;
        }
        // 计数数组（存放使用了的0-9的数字）
        int[] c = new int[10];
        while (ret!=0) {
            c[ret%10]++;
            ret/=10;
        }
        // 如果0-9中的数字出现了不止一次，就返回
        int i = 0;
        for (i = 0; i < 10; i++) {
            if (b[i]+c[i]!=1) {
                break;
            }
        }
        // 条件成立就打印
        if (i==10) {
            // 计数器加1
            s++;
            System.out.printf("%05d / %05d = %d\n",y*n,y,n);
        }
    }

    // 获得五个数的全排列【递归】
    public static void Perm(int p,int[] a,int[] b,int n) {
        if (p==5) {
            check(a,b,n);
            return;
        }
        for (int k = 0; k < 10; k++) {
            if (b[k]!=0) continue;
            a[p]=k;
            b[k]=1;
            Perm(p+1,a,b,n);
            b[k]=0;
        }
    }


    // 分数拆分问题
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int count = 0;
        while (scanner.hasNextInt()) {
            int k = scanner.nextInt();
            // 由 1/k = 1/x + 1/y；x>=y.可推出：k>=y/2
            for (int i = k+1; i <= 2*k; i++) {
                int y = i;
                if (k*y%(y-k)==0) {
                    System.out.printf("%d/%d = %d/%d + %d/%d\n",1,k,1,y,1,k*y/(y-k));
                    count++;
                }

            }
        }

    }






}
